jsCoq: Towards Hybrid Theorem Proving Interfaces
نویسندگان
چکیده
منابع مشابه
jsCoq: Towards Hybrid Theorem Proving Interfaces
We describe jsCoq, a new platform and user environment for the Coq interactive proof assistant. The jsCoq system targets the HTML5–ECMAScript 2015 specification, and it is typically run inside a standards-compliant browser, without the need of external servers or services. Targeting educational use, jsCoq allows the user to start interaction with proof scripts right away, thanks to its self-con...
متن کاملTowards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of substructural logics. Such a basis is founded on structurally-free logic, a logic in which the usual structural rules are replaced by complex combinator rules , and thus constitute a generalization of traditional sequent ...
متن کاملTowards an Open System for Theorem Proving towards an Open System for Theorem Proving
In this contribution I advocate an open system for formalised mathematical reasoning that is able to capture diierent mathematical formalisms as well as a wide variety of proof formats. This is assumed to be much more adequate since it more closely reeects the situation in mathematics as a whole. In particular I try to classify diierent dimension according to which proofs can be classiied.
متن کاملBellerophon: Tactical Theorem Proving for Hybrid Systems
Hybrid systems combine discrete and continuous dynamics, which makes them attractive as models for systems that combine computer control with physical motion. Verification is undecidable for hybrid systems and challenging for many models and properties of practical interest. Thus, human interaction and insight are essential for verification. Interactive theorem provers seek to increase user pro...
متن کاملDistributed Theorem Proving for Distributed Hybrid Systems
Distributed hybrid systems present extraordinarily challenging problems for verification. On top of the notorious difficulties associated with distributed systems, they also exhibit continuous dynamics described by quantified differential equations. All serious proofs rely on decision procedures for real arithmetic, which can be extremely expensive. Quantified Differential Dynamic Logic (QdL) h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2017
ISSN: 2075-2180
DOI: 10.4204/eptcs.239.2